Ready simulation for concurrency: It’s logical!
نویسندگان
چکیده
منابع مشابه
Ready Simulation for Concurrency: It's Logical!
This paper provides new insight into the connection between the trace-based lower part of van Glabbeek’s linear-time, branchingtime spectrum and its simulation-based upper part. We establish that ready simulation is fully abstract with respect to failures inclusion, when adding the conjunction operator that was proposed by the authors in [TCS 373(1–2):19–40] to the standard setting of labelled ...
متن کاملLogical Semantics of Types for Concurrency
We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic type system for the π-calculus, which may be instantiated for specific notions of typing by extension with adequate subtyping principles. Soundness of our type system is established using a logical predicate technique, ...
متن کاملLinear Logical Relations for Session-Based Concurrency
In prior work we proposed an interpretation of intuitionistic linear logic propositions as session types for concurrent processes. The type system obtained from the interpretation ensures fundamental properties of session-based typed disciplines—most notably, type preservation, session fidelity, and global progress. In this paper, we complement and strengthen these results by developing a theor...
متن کاملConcurrency, Fairness and Logical Complexity
We consider a connection between fairness and 0 3 sets of functions made recently by Darondeau, Nolte, Priese and Yoccoz, and extend their work to cater for eeective asynchronous transition systems with concurrency structure represented by a Mazurkiewicz independency relation.
متن کاملSimulation Refinement for Concurrency Verification
In recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refinement mappings. The present paper gives an overview of several extensions of the theory and of a number of recent applications to practical verifications. It concludes with a sketch of the results on semantic completeness, and a discussion of the relationship between semantic completeness and methodolog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.02.001